Solupals - Textbook Solutions Solutions Cryptography and Network Security principles an practice - 4th edition- William Stallings



9.17 Here is another realization of the fast exponentiation algorithm. Demonstrate that it is equivalent to the one inF igure 9.7.
1. f<- 1; T<- a; E <-b
2. if odd(
e) then f d x T
3. E |E/2|
4. T T x T
5. if E > 0 then goto 2
6. output f
 
 
View Solution
 
 
 
<< Back Next >>